package algorithmTopics.string;

import java.util.ArrayList;
import java.util.List;

/**
 * 测试一下
 * 所有关于字符串的题目
 *
 * @author 86155
 * @date 2025/05/14
 */
public class test {


    public static void main(String[] args) {
        Solution solution = new Solution();
        //test3(solution);
        //test2566(solution);
        test115(solution);
    }

    private static void test115(Solution solution) {
        //solution.numDistinct("rabbbit", "rabbit");
        solution.numDistinct("ddd", "dd");
    }

    private static void test721(Solution solution) {
        solution.minimumDeleteSum("leet", "delete");
    }

    private static void test72(Solution solution) {
        solution.minDistance("horse", "ros");
    }

    private static void test139(Solution solution) {
        solution.wordBreak("leetcode", new ArrayList<>(List.of("leet","code")));
    }

    private static void test43(Solution solution) {
        solution.multiply("123", "465");
    }

    private static void test67(Solution solution) {
        solution.addBinary("1010", "1011");
    }

    private static void test13(Solution solution) {
        solution.romanToInt("III");
    }

    private static void test76(Solution solution) {
        solution.minWindow("ADOBECODEBANC", "ABC");
    }

    static void test49(Solution solution) {
        solution.groupAnagrams(new String[]{"eat","tea","tan","ate","nat","bat"});
    }

    static void test3(Solution solution) {
        int abcabcbb = solution.lengthOfLongestSubstring("abcabcbb");
        System.out.println(abcabcbb);
    }
    static void test2566(Solution solution) {

        System.out.println(solution.minMaxDifference(90));
    }
}
